Take Manhattan

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Manhattan World

This paper argues that many visual scenes are based on a ”Manhattan” three-dimensional grid which imposes regularities on the image statistics. We construct a Bayesian model which implements this assumption and estimates the viewer orientation relative to the Manhattan grid. For many images, these estimates are good approximations to the viewer orientation (as estimated manually by the authors)...

متن کامل

The Manhattan Effect 1

Research on close relationships has frequently contrasted one’s own interests with the interests of the partner or the relationship, and has tended to view the partner’s and the relationship’s interests as inherently aligned. The present article demonstrated that relationship commitment typically causes people to support their partner’s personal interests, but that this effect gets weaker to th...

متن کامل

From MiniMax to Manhattan

The thinking-process for playing chess by computer is significantly different, from that used by humans. Also, computer hardware/software has evolved considerably in the half century since minimax was first, proposed as a method for computers to play chess. In this paper we look at. the technology behind today’s chess programs, how it has developed, its current, status, and explore some directi...

متن کامل

Approximating Minimum Manhattan Networks

Given a set S of n points in the plane, we deene a Manhattan Network on S as a rectilinear network G with the property that for every pair of points in S, the network G contains the shortest rectilinear path between them. A Minimum Manhattan Network on S is a Manhattan network of minimum possible length. A Manhattan network can be thought of as a graph G = (V; E), where the vertex set V corresp...

متن کامل

Unfolding Manhattan Towers

We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The algorithm cuts along edges of a 4×5×1 refinement of the vertex grid.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1987

ISSN: 0028-0836,1476-4687

DOI: 10.1038/327292b0